Sets of points with pairwise distinct slopes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer sets with prescribed pairwise differences being distinct

We label the vertices of a given graph G with positive integers so that the pairwise differences over its edges are all distinct. Let D(G) be the smallest value that the largest label can have. For example, for the complete graph Kn, the labels must form a Sidon set. Hence, D(Kn) = (1 + o(1))n2. Rather surprisingly, we demonstrate that there are graphs with only n 3 2 +o(1) edges achieving this...

متن کامل

Pairwise - slopes statistics for testing curvature

This paper introduces nonparametric U-statistics for testing the curvature (e.g., linearity, concavity, or convexity) of an unknown regression function. The U-statistics are based on pairwise slopes in the data. No choice of smoothing parameters is required for the global version of the statistics or their (asymptotic) standard errors, making them simple to compute. The proposed tests are analo...

متن کامل

Bounds for arrays of dots with distinct slopes or lengths

An n x m sonar sequence is a subset of the n x m grid with exactly one point in each column, such that the (r~) vectors determined by them are all distinct. We show that for fixed n the maximal m for which a sonar sequence exists satisfies n-Cn 11/20 < m < n + 4n 2/3 for all n and m > n + c log n log log n for infinitely many n. Another problem concerns the maximal number D of points that can b...

متن کامل

Some points on generalized open sets

The paper is an attempt to represent a study of limit points, boundary points, exterior points, border, interior points and closure points in the common generalized topological space. This paper takes a look at the possibilities of an extended topological space and it also considers the new characterizations of dense set.

متن کامل

Sets of Points with Many Halving Lines

We used a genetic search algorithm to find sets of points with many halving lines. There are sets of 10 points with 13 halving lines, 12 points with 18 halving lines, 14 points with 22 halving lines, 16 points with 27 halving lines, and 18 points with 32 halving lines. We find a construction generalizing the 12 point configuration and show that, for any n = 3 · 2, there are configurations of n ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2000

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(00)00115-2